Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
نویسندگان
چکیده
Probabilistic ω-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring that (i) the probability for the accepting runs is positive (probable semantics), or (ii) almost all runs are accepting (almost-sure semantics), or (iii) the probability measure of the accepting runs is greater than a certain threshold (threshold semantics). The underlying notion of an accepting run can be defined as for standard ω-automata by means of a Büchi condition or other acceptance conditions, e. g., Rabin or Streett conditions. In this paper, we put the main focus on the probable semantics and provide a summary of the fundamental properties of probabilistic ω-automata concerning expressiveness, efficiency, and decision problems.
منابع مشابه
The Decidability Frontier for Probabilistic Automata on Infinite Words
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative ...
متن کاملProbabilistic Automata on Infinite Words: Decidability and Undecidability Results
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs of [GO09] and present a precise characterization of the decidability and undecidability frontier of the quantitative and qualitative decision p...
متن کاملInfinite Synchronizing Words for Probabilistic Automata (Erratum)
In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the decidability result of [1,2,3] for the emptiness problem of weakly synchronizing language is incorrect.
متن کاملDecidable and Expressive Classes of Probabilistic Automata
Hierarchical probabilistic automata (HPA) are probabilistic automata whose states are partitioned into levels such that for any state and input symbol, at most one transition with non-zero probability goes to a state at the same level, and all others go to states at a higher level. We present expressiveness and decidability results for 1-level HPAs that work on both finite and infinite length i...
متن کاملRelating Paths in Transition Systems: the Fall of the Modal mu-Calculus
This is an extended abstract of a paper presented at MFCS 2015 [11]. Monadic second-order logic (MSO) is considered as a standard for comparing expressiveness of logics of programs. Ground-breaking results concerning expressiveness and decidability of MSO on infinite graphs were obtained first on “freely-generated” structures (words, trees, tree-like structures, etc.) [28,30], then on “non-free...
متن کامل